abstract consistency class
Cut-Simulation and Impredicativity
Benzmueller, Christoph, Brown, Chad E., Kohlhase, Michael
We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for classical type theory -- is like adding cut. The phenomenon equally applies to prominent axioms like Boolean- and functional extensionality, induction, choice, and description. This calls for the development of calculi where these principles are built-in instead of being treated axiomatically.
0902.0043
Country:
- Europe > United Kingdom > England > Cambridgeshire > Cambridge (0.14)
- Europe > Germany > Bremen > Bremen (0.14)
- Europe > Germany > Saarland > Saarbrücken (0.04)
- North America > United States > California > Santa Clara County > Stanford (0.04)
Technology: Information Technology > Artificial Intelligence > Representation & Reasoning > Logic & Formal Reasoning (1.00)